Tool Carousel Design via Integer Programming
نویسنده
چکیده
We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algorithm are generated by relaxing the side constraints and using the Hungarian method to solve the resulting assignment problem. Partitioning in a manner similar to subtour elimination for the travelling salesman problem leads to encouraging computational results.
منابع مشابه
A survey on performance analysis of warehouse carousel systems
This paper gives an overview of recent research on the performance evaluation and design of carousel systems. We discuss picking strategies for problems involving one carousel, consider the throughput of the system for problems involving two carousels, give an overview of related problems in this area, and present an extensive literature review. Emphasis has been given on future research direct...
متن کاملA Mixed Integer Linear Programming Model for the Design of Remanufacturing Closed–loop Supply Chain Network
Closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. In this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. First, a mixed-integer linear programming formulation is developed to maximize the total profit. The main contribution...
متن کاملA multi-period fuzzy mathematical programming model for crude oil supply chain network design considering budget and equipment limitations
The major oil industry upstream activities include the exploration, drilling, extraction, pipelines installation, and production of crude oil. In this paper, we develop a mathematical model to plan for theseoperations as a crude oil supply chain network design problem.The proposed multi-period mixed integer linear programming model entails both strategic (e.g., facility location and allocation)...
متن کاملOptimal TCSC Placement Based on Line Flow Equations via Mixed-Integer Linear Programming
Research effort has been given to find the optimal location and initial settings of Thyristor-Controlled Series Capacitor (TCSC) using Mixed-Integer Linear Programming (MILP). As a useful tool for combinatorial optimisation over integer and continuous variables, mixed-integer programming approach can provides robust performance as well as high computation efficiency when solving complex optimal...
متن کاملA Fuzzy Mixed-integer Goal Programming Model for Determining an Optimal Compromise Mix of Design Requirements in Quality Function Deployment
Quality function deployment is a well-known customer-oriented design procedure for translating the voice of customers into a final production. This is a way that higher customer satisfaction is achieved while the other goals of company may also be met. This method, at the first stage, attempts to determine the best fulfillment levels of design requirements which are emanated by customer needs. ...
متن کامل